147 research outputs found
A short note on Simulation and Abstraction
This short note is written in celebration of David Schmidt's sixtieth
birthday. He has now been active in the program analysis research community for
over thirty years and we have enjoyed many interactions with him. His work on
characterising simulations between Kripke structures using Galois connections
was particularly influential in our own work on using probabilistic abstract
interpretation to study Larsen and Skou's notion of probabilistic bisimulation.
We briefly review this work and discuss some recent applications of these ideas
in a variety of different application areas.Comment: In Proceedings Festschrift for Dave Schmidt, arXiv:1309.455
Fast Multi-Scale Community Detection based on Local Criteria within a Multi-Threaded Algorithm
Many systems can be described using graphs, or networks. Detecting
communities in these networks can provide information about the underlying
structure and functioning of the original systems. Yet this detection is a
complex task and a large amount of work was dedicated to it in the past decade.
One important feature is that communities can be found at several scales, or
levels of resolution, indicating several levels of organisations. Therefore
solutions to the community structure may not be unique. Also networks tend to
be large and hence require efficient processing. In this work, we present a new
algorithm for the fast detection of communities across scales using a local
criterion. We exploit the local aspect of the criterion to enable parallel
computation and improve the algorithm's efficiency further. The algorithm is
tested against large generated multi-scale networks and experiments demonstrate
its efficiency and accuracy.Comment: arXiv admin note: text overlap with arXiv:1204.100
MaxSAT Evaluation 2020 -- Benchmark: Identifying Maximum Probability Minimal Cut Sets in Fault Trees
This paper presents a MaxSAT benchmark focused on the identification of
Maximum Probability Minimal Cut Sets (MPMCSs) in fault trees. We address the
MPMCS problem by transforming the input fault tree into a weighted logical
formula that is then used to build and solve a Weighted Partial MaxSAT problem.
The benchmark includes 80 cases with fault trees of different size and
composition as well as the optimal cost and solution for each case.Comment: 5 pages, 1 figure. To appear in Proceedings of the MaxSAT Evaluation
2020 (MSE'20). https://maxsat-evaluations.github.io/2020
- …